Model checking dynamic epistemics in branching time

نویسندگان

  • H. P. van Ditmarsch
  • J. Ruan
  • W. van der Hoek
چکیده

We give a relation between a logic of knowledge and change, with a semantics on Kripke models, and a logic of knowledge and time, with a semantics on interpreted systems. More in particular, given an epistemic state and a formula in action model logic, we construct an interpreted system relative to that epistemic state and that formula that satisfies the translation of the formula into branching temporal epistemic logic. The construction involves that the protocol that is implicit in the dynamic epistemic formula, i.e. the set of sequences of events being executed to evaluate the formula, is made explicit. For presentation reasons, we focus on the logic of knowledge and change that is known as public announcement logic, which can be seen as a specific action model logic. The interpreted system that is constructed in the process is minimal in the sense that it precisely contains all the event structure present in the dynamic epistemic formula. Different approaches to this correspondence can be considered syntactic or semantic sugar. That observation brings applications of our insights closer, because some such approaches originate in the model checking community.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking

Bounded model-checking is a technique for finding bugs in very large designs. Bounded model-checking by itself is incomplete: it can find bugs, but it cannot prove that a system satisfies a specification. A dynamic completeness criterion can allow bounded model-checking to prove properties. A dynamic completeness criterion typically searches for a “beginning” of a bug or bad behavior; if no suc...

متن کامل

Branching-Time Temporal Logic and Tree Automata

JJ89] C. Jard and T. Jeron. On-line model-checking for nite linear temporal logic speciications. 6 Conclusions In this paper we showed that tree automata, which have been considered unsuitable for branching-time model checking, provide a neat and optimal framework for branching-time temporal logics and can handle, eeciently, model checking. The crucial point in our method is that when branching...

متن کامل

Model Checking the Branching Time Temporallogic

Reachability analysis is a method for analyzing the dynamic behavior of a concurrent system. One way of specifying the properties that the behaviors of the system must fullll is to use the branching time temporal logic CTL (Computation tree logic). The process of checking whether the behavior of the system fulllls the speciied property is called model checking. In this work we analyze several a...

متن کامل

A New Approach to Bounded Model Checking for Branching Time Logics

Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically applied only for linear-time properties, with a few exceptions, which search for a counter-example in the form of a tree-like structure with a pre-determined shape. We suggest a new approach to bounded model checking for universa...

متن کامل

On the fly model checking of communicating UML State Machines1

In this paper we present an ``on the fly'' model checker for the verification of the dynamic behavior of UML models seen as a set of communicating state machines. The logic supported by the tool is an extension of the action based branching time temporal logic μ-ACTL and has the power of full μ-calculus. Early results on the application of this model checker to a case study have been also repor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007